Orthogonal Reference Vectors Selection Method of Subspace Interference Alignment
نویسندگان
چکیده
منابع مشابه
Optimal Reference Vector Selection Algorithm in Subspace Interference Alignment to Maximize System Throughput
Arbitrary reference vectors have been adopted in conventional subspace alignment as transmitting vectors at the transmitter side. Inter-cell interference among users can be eliminated using orthogonal vectors to the chosen reference vectors at the receiver side. However, in this case, the sum-rate varies using different reference vectors, even though the channel values remain constant, and vice...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملRandom subspace method for multivariate feature selection
In a growing number of domains the data collected has a large number of features. This poses a challenge to classical pattern recognition techniques, since the number of samples often is still limited with respect to the feature size. Classical pattern recognition methods suffer from the small sample size, and robust classification techniques are needed. In order to reduce the dimensionality of...
متن کاملHand Shape Recognition Based on Kernel Orthogonal Mutual Subspace Method
This paper proposes a method of recognizing a hand shape using multiple view images. The recognition of a hand is a difficult problem, as its appearance changes largely depending on view point, illumination condition and individual characteristics. To overcome this problem, we apply the Kernel Orthogonal Mutual Subspace Method to shift invariant features, HLAC(Higherorder Local Auto-Correlation...
متن کاملThe Extended Krylov Subspace Method and Orthogonal Laurent Polynomials
Abstract. The need to evaluate expressions of the form f(A)v, where A is a large sparse or structured symmetric matrix, v is a vector, and f is a nonlinear function, arises in many applications. The extended Krylov subspace method can be an attractive scheme for computing approximations of such expressions. This method projects the approximation problem onto an extended Krylov subspace K(A) = s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korea Information and Communications Society
سال: 2011
ISSN: 1226-4717
DOI: 10.7840/kics.2011.36a.5.457